Sentiment Classification Using Word Sub-sequences and Dependency Sub-trees
نویسندگان
چکیده
Document sentiment classification is a task to classify a document according to the positive or negative polarity of its opinion (favorable or unfavorable). We propose using syntactic relations between words in sentences for document sentiment classification. Specifically, we use text mining techniques to extract frequent word sub-sequences and dependency sub-trees from sentences in a document dataset and use them as features of support vector machines. In experiments on movie review datasets, our classifiers obtained the best results yet published using these data.
منابع مشابه
Fine-tuning Tree-LSTM for phrase-level sentiment classification on a Polish dependency treebank. Submission to PolEval task 2
We describe a variant of Child-Sum Tree-LSTM deep neural network (Tai et al., 2015) fine-tuned for working with dependency trees and morphologically rich languages using the example of Polish. Fine-tuning included applying a custom regularization technique (zoneout, described by (Krueger et al., 2016), and further adapted for Tree-LSTMs) as well as using pre-trained word embeddings enhanced wit...
متن کاملIdentifying High-Impact Sub-Structures for Convolution Kernels in Document-level Sentiment Classification
Convolution kernels support the modeling of complex syntactic information in machinelearning tasks. However, such models are highly sensitive to the type and size of syntactic structure used. It is therefore an important challenge to automatically identify high impact sub-structures relevant to a given task. In this paper we present a systematic study investigating (combinations of) sequence an...
متن کاملLong Short-term Memory Network over Rhetorical Structure Theory for Sentence-level Sentiment Analysis
Using deep learning models to solve sentiment analysis of sentences is still a challenging task. Long short-term memory (LSTM) network solves the gradient disappeared problem existed in recurrent neural network (RNN), but LSTM structure is linear chain-structure that can’t capture text structure information. Afterwards, Tree-LSTM is proposed, which uses LSTM forget gate to skip sub-trees that h...
متن کاملDependency Based Embeddings for Sentence Classification Tasks
We compare different word embeddings from a standard window based skipgram model, a skipgram model trained using dependency context features and a novel skipgram variant that utilizes additional information from dependency graphs. We explore the effectiveness of the different types of word embeddings for word similarity and sentence classification tasks. We consider three common sentence classi...
متن کاملA Study of Dependency Features for Chinese Sentiment Classification
Syntactic dependency features, which encode long-range dependency relations and word order information, have been employed in sentiment classification. However, much of the research has been done in English, and researches conducted on exploring how features based on syntactic dependency relations can be utilized in Chinese sentiment classification are very rare. In this study, we present an em...
متن کامل